Quantum rate-distortion theory for memoryless sources

نویسندگان

  • Igor Devetak
  • Toby Berger
چکیده

We formulate quantum rate-distortion theory in the most general setting where classical side information is included in the tradeoff. Using a natural distortion measure based on entanglement fidelity and specializing to the case of an unrestricted classical side channel, we find the exact quantum rate-distortion function for a source of isotropic qubits. An upper bound we believe to be exact is found in the case of biased sources. We establish that in this scenario optimal rate-distortion codes produce no entropy exchange with the environment of any individual qubit.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compression of sources of probability distributions and density operators

We study the problem of efficient compression of a stochastic source of probability distributions. It can be viewed as a generalization of Shannon’s source coding problem. It has relation to the theory of common randomness, as well as to channel coding and rate–distortion theory: in the first two subjects “inverses” to established coding theorems can be derived, yielding a new approach to provi...

متن کامل

On the cost of finite block length in quantizing unbounded memoryless sources

The problem of fixed-rate block quantization of an unbounded real memoryless source is studied. It is proved that if the source has a finite sixth moment, then there exists a sequence of quantizers Qn of increasing dimension n and fixed rate R such that the mean squared distortion A(Q,) is bounded as A(Q,) < D(R) + O(dm), where D(R) is the distortion-rate function of the source. Applications of...

متن کامل

An Iterative Algorithm for Computing the Optimal Exponent of Correct Decoding Probability for Rates below the Rate Distortion Function

The form of Dueck and Körner’s exponent function for correct decoding probability for discrete memoryless channels at rates above the capacity is similar to the form of Csiszár and Körner’s exponent function for correct decoding probability in lossy source coding for discrete memoryless sources at rates below the rate distortion function. We recently gave a new algorithm for computing Dueck and...

متن کامل

Fixed-rate universal lossy source coding and rates of convergence for memoryless sources

AbstructA fixed-rate universal lossy coding scheme is introduced for independent and identically distributed (i.i.d.) sources. It is shown for finite alphabet sources and arbitrary single letter distortion measures that as the sample size T I grows the expected distortion obtained using this universal scheme converges to Shannon’s distortion rate function D ( R ) at a rate 0 (log , I / , , ) . ...

متن کامل

An implementable lossy version of the Lempel-Ziv algorithm - Part I: Optimality for memoryless sources

A new lossy variant of the Fixed-Database Lempel–Ziv coding algorithm for encoding at a fixed distortion level is proposed, and its asymptotic optimality and universality for memoryless sources (with respect to bounded single-letter distortion measures) is demonstrated: As the database size m increases to infinity, the expected compression ratio approaches the rate-distortion function. The comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2002